Diversity of Listeria monocytogenes strains of clinical and food chain origins in Belgium between 1985 and 2014

Listeriosis is a rare but severe disease, mainly caused by Listeria monocytogenes. This study shows the results of the laboratory-based surveillance of Listeriosis in Belgium over the period 1985-2014. Besides the incidence and some demographic data we present also more detailed microbiological and molecular characteristics of human strains isolated since 2000. The strains from the latter period were compared to food and animal strains from the same period. Our study shows that different food matrices were commonly contaminated with L. monocytogenes presenting the same PFGE profile as in patient's isolates. Since 1985, we observed a significant decrease in incidence of the Materno-Neonatal cases (from 0.15 to 0.04 cases /100,000 inhabitants-year), which is probably to be attributed to active prevention campaigns targeting pregnant women. Despite the strengthening of different control measures by the food industry, the incidence of non-Materno-Neonatal listeriosis increased in Belgium (from 0.3 to 0.7 cases /100,000 inhabitants-year), probably due to the rise of highly susceptible patients in an aging population. This significant increase found in non-Materno-Neonatal cases (slope coefficient 7.42%/year, P< 0.0001) can be attributed to significant increase in incidence of isolates belonging to serovars 1/2a (n = 393, slope coefficient 6.62%/year, P< 0.0001). Although resistance to antimicrobials is rare among L. monocytogenes isolates, a trend to increasing MIC values is evident with chloramphenicol, amoxicillin, tetracycline and ciprofloxacin. We show that fluoroquinolone resistance is not linked to chromosomal mutations, but caused by a variety of efflux pumps. Our study also shows that huge majority of known underlying pathologies (426 out of 785 cases) were cancers (185/426, 43.1%) and haematological malignancies (75/185, 40.5%). Moreover the risk population is susceptible to low levels of contamination in food stressing the need of prevention campaigns specifically targeting these persons

Too Afraid to Learn: Attitudes towards Statistics as a Barrier to Learning Statistics and to Acquiring Quantitative Skills

Quantitative skills are important for studying and understanding social reality. Political science students, however, experience difficulties in acquiring and retaining such skills. Fear of statistics has often been listed among the major causes for this problem. This study aims at understanding the underlying factors for this anxiety and proposes a potential remedy. More specifically, we advocate the integration of quantitative material into non-methodological courses. After assessing the influence of dispositional, course-related and person-related factors on the attitudes towards statistics among political science students, we provide insights into the relation between these attitudes on the one hand and the learning and retention of statistics skills on the other. Our results indicate that a curriculum-wide approach to normalise the use of quantitative methods can not only foster interest in statistics but also foster retention of the acquired skills

Relational symbolic execution of SQL code for unit testing of database programs

Symbolic execution is a technique enabling the automatic generation of test inputs that exercise a set of execution paths within a code unit to be tested. If the paths cover a sufficient part of the code under test, the test data offer a representative view of the actual behaviour of this code. This notably enables detecting errors and correcting faults. Relational databases are ubiquitous in software, but symbolic execution of code units that manipulate them remains a non-trivial problem, particularly because of the complex structure of such databases and the complex behaviour of SQL statements. Finding errors in such code units is yet critical, as it can avoid corrupting important data. In this work, we define a symbolic execution translating database manipulation code directly into constraints and integrate it with a more traditional symbolic execution of normal program code. The database tables are represented by relational symbols and the SQL statements by relational constraints over these symbols. An algorithm based on these principles is presented for the symbolic execution of simple Java methods that implement transactional use cases by reading and writing in a relational database, the latter subject to data integrity constraints. The algorithm is integrated in a test generation tool and experimented over sample code. The target language for the constraints produced by the tool is the SMT-Lib standard and the used solver is Microsoft Z3. The results show that the proposed approach enables generating meaningful test data, including valid database content, in reasonable time. In particular, the Z3 solver is shown to be more scalable than the Alloy solver, used in our previous work, for solving relational constraints

Specializing Interpreters using Offline Partial Deduction

We present the latest version of the Logen partial evaluation system for logic programs. In particular we present new binding-types, and show how they can be used to effectively specialise a wide variety of interpreters.We show how to achieve Jones-optimality in a systematic way for several interpreters. Finally, we present and specialise a non-trivial interpreter for a small functional programming language. Experimental results are also presented, highlighting that the Logen system can be a good basis for generating compilers for high-level languages

A Direct Symbolic Execution of SQL Code for Testing of Data-Oriented Applications

Symbolic execution is a technique which enables automatically generating test inputs (and outputs) exercising a set of execution paths within a program to be tested. If the paths cover a sufficient part of the code under test, the test data offer a representative view of the program's actual behaviour, which notably enables detecting errors and correcting faults. Relational databases are ubiquitous in software, but symbolic execution of pieces of code that manipulate them remains a non-trivial problem, particularly because of the complex structure of such databases and the complex behaviour of SQL statements. In this work, we define a direct symbolic execution for database manipulation code and integrate it with a more traditional symbolic execution of normal program code. The database tables are represented by relational symbols and the SQL statements by relational constraints over these symbols and the symbols representing the normal variables of the program. An algorithm based on these principles is presented for the symbolic execution of Java methods that implement business use cases by reading and writing in a relational database, the latter subject to data integrity constraints. The algorithm is integrated in a test generation tool and experimented over sample code. The target language for the constraints produced by the tool is the SMT-Lib standard and the used solver is Microsoft Z3. The results show that the proposed approach enables generating meaningful test data, including valid database content, in reasonable time. In particular, the Z3 solver is shown to be more scalable than the Alloy solver, used in our previous work, for solving relational constraints

Comparing Regional Patterns of Individual Movement Using Corrected Mobility Entropy

In this paper, we propose a correction of the Mobility Entropy indicator (ME) used to describe the diversity of individual movement patterns as can be captured by data from mobile phones. We argue that a correction is necessary because standard calculations of ME show a structural dependency on the geographical density of observation points, rendering results biased and comparisons between regions incorrect. As a solution, we propose the Corrected Mobility Entropy (CME). We apply our solution to a French mobile phone dataset with ∼18.5 million users. Results show CME to be less correlated to cell-tower density (r = –0.17 instead of –0.59 for ME). As a spatial pattern of mobility diversity, we find CME values to be higher in suburban regions compared to their related urban centers, while both decrease considerably with lowering urban center sizes. Based on regression models, we find mobility diversity to relate to factors like income and employment. Additionally, using CME reveals the role of car use in relation to land use, which was not recognized when using ME values. Our solution enables a better description of individual mobility at a large scale, which has applications in official statistics, urban planning and policy, and mobility research

Inference of Well-Typings for Logic Programs with Application to Termination Analysis

This paper develops a method to infer a polymorphic well-typing for a logic program. One of the main motivations is to contribute to a better automation of termination analysis in logic programs, by deriving types from which norms can automatically be constructed. Previous work on type-based termination analysis used either types declared by the user, or automatically generated monomorphic types describing the success set of predicates. Declared types are typically more precise and result in stronger termination conditions than those obtained with inferred types. Our type inference procedure involves solving set constraints generated from the program and derives a well-typing in contrast to a success-set approximation. Experiments show that our automatically inferred well-typings are close to the declared types and thus result in termination conditions that are as good as those obtained with declared types for all our experiments to date. We describe the method, its implementation and experiments with termination analysis based on the inferred types

Homeomorphic Embedding for Online Termination of Symbolic Methods

Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of techniques for program analysis, specialisation, transformation, and verification. In this paper we survey and discuss this use of homeomorphic embedding and clarify the advantages of such an approach over one using well-founded orders. We also discuss various extensions of the homeomorphic embedding relation. We conclude with a study of homeomorphic embedding in the context of metaprogramming, presenting some new (positive and negative) results and open problems

Yukawa couplings and masses of non-chiral states for the Standard Model on D6-branes on T6/Z6'

The perturbative leading order open string three-point couplings for the Standard Model with hidden USp(6) on fractional D6-branes on T6/Z6' from arXiv:0806.3039 [hep-th], arXiv:0910.0843 [hep-th] are computed. Physical Yukawa couplings consisting of holomorphic Wilsonian superpotential terms times a non-holomorphic prefactor involving the corresponding classical open string Kaehler metrics are given, and mass terms for all non-chiral matter states are derived. The lepton Yukawa interactions are at leading order flavour diagonal, while the quark sector displays a more intricate pattern of mixings. While N=2 supersymmetric sectors acquire masses via only two D6-brane displacements - which also provide the hierarchies between up- and down-type Yukawas within one quark or lepton generation -, the remaining vector-like states receive masses via perturbative three-point couplings to some Standard Model singlet fields with vevs along flat directions. Couplings to the hidden sector and messengers for supersymmetry breaking are briefly discussed.Comment: 52 pages (including 8p. appendix); 5 figures; 14 tables; v2: discussion in section 4.1.3 extended, footnote 5 added, typos corrected, accepted by JHE